Branch-and-Price and Multicommodity Flows
نویسندگان
چکیده
منابع مشابه
Designing WDM Optical Networks Using Branch-and-Price
In this paper, we present an exact solution procedure for the design of two-layer wavelength division multiplexing (WDM) optical networks with wavelength changers and bifurcated flows. This design problem closely resembles the traditional multicommodity flow problem, except that in the case of WDM optical networks, we are concerned with the routing of multiple commodities in two network layers....
متن کاملComparing Branch-and-price Algorithms for the Unsplittable Multicommodity Flow Problem
In this paper we address branch-and-price algorithms for the unsplittable multicommodity flow problem. This problem is defined over a capacitated network in which we intend to route a set of commodities, each one with a given origin, destination and demand, at minimal cost, without exceeding the arc capacities. Furthermore, the flow of each commodity must be routed using a single path. Formulat...
متن کاملUsing Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems
We present a column-generation model and branch-and-price-and-cut algorithm for origin-destination integer multicommodity flow problems. The origin-destination integer multicommodity flow problem is a constrained version of the linear multicommodity flow problem in which flow of a commodity (defined in this case by an origin-destination pair) may use only one path from origin to destination. Br...
متن کاملBranch-and-Price Guided Search for Integer Programs with an Application to the Multicommodity Fixed-Charge Network Flow Problem
with an Application to the Multicommodity Fixed Charge Network Flow Problem Mike Hewitt Department of Industrial and Systems Engineering, Rochester Institute of Technology, Rochester, NY 14623, USA, [email protected], George Nemhauser H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332, USA, [email protected], Martin W.P...
متن کاملA Branch-and-Price Algorithm for the Risk-Equity Constrained Routing Problem
We study a multi-criteria variant of the problem of routing hazardous material on a geographical area subdivided in regions. The two objective functions are given by a generally defined routing cost and a risk equity equal to the maximum, over each region, of the risk perceived within a region. This is a multicommodity flow problem where integer variables are used to define the number of trucks...
متن کامل